Travelling salesman problem - PDFSEARCH.IO - Document Search Engine

Travelling salesman problem
Results: 321

#	Item
71	6.889 — Lecture 15: Traveling Salesman (TSP) Christian Sommer (figures by Philip Klein) November 2, 2011 Traveling Salesman Problem (TSP) given G = (V, E) find a tour visiting each1 node v ∈ V . NP–har Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-11-29 11:50:24 Spanning tree NP-complete problems Operations research Travelling salesman problem Graph operations Minimum spanning tree Graph Planar graph Eulerian path Graph theory Theoretical computer science Mathematics
72	PDF Document Add to Reading List Source URL: web.eecs.umich.edu Language: English - Date: 2014-02-11 03:59:44 Combinatorial optimization NP-complete problems Matching Cut Shortest path problem Time complexity Maximum cut Travelling salesman problem Hungarian algorithm Theoretical computer science Graph theory Mathematics
73	Mathematical Programming manuscript No. (will be inserted by the editor) Sanjeev Arora ? Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-02-04 13:37:22 NP-complete problems Complexity classes Approximation algorithms Spanning tree Travelling salesman problem Polynomial-time approximation scheme Time complexity Optimization problem Algorithm Theoretical computer science Computational complexity theory Applied mathematics
74	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:05 NP-complete problems Clique Travelling salesman problem Vertex cover NP-complete Cut Path decomposition Feedback vertex set Graph theory Theoretical computer science Mathematics
75	LOGO_frontiersinpsychology Add to Reading List Source URL: psych.nyu.edu Language: English - Date: 2010-12-08 10:49:32 Applied mathematics Heuristic function Travelling salesman problem A* search algorithm Heuristic Route planning software Mathematics Theoretical computer science Heuristics
76	Parallel Branch-and-Bound for Two-Stage Stochastic Integer Optimization Akhil Langer‡ , Ramprasad Venkataraman‡ , Udatta Palekar∗ , Laxmikant V. Kale‡ ‡ Department of Computer Science, ∗ College of Business Add to Reading List Source URL: charm.cs.illinois.edu Language: English - Date: 2014-02-05 22:25:28 Theoretical computer science Linear programming Mathematical optimization Travelling salesman problem Stochastic programming Search algorithm Stochastic optimization Sudoku algorithms Operations research Mathematics Applied mathematics
77	Course Information Sheet Course: BMGT 831 (Network Optimization) Add to Reading List Source URL: www.amsc.umd.edu Language: English - Date: 2010-10-25 17:36:24 Operations research NP-complete problems Academia Mathematical optimization Combinatorial optimization Computational complexity theory Shortest path problem Academic dishonesty Travelling salesman problem Theoretical computer science Applied mathematics Mathematics
78	Distance Estimation and Object Location via Rings of Neighbors ∗ Aleksandrs Slivkins† February 2005 Revised: June 2005, Nov 2005, April 2006, SeptAbstract Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2006-09-17 17:37:38 Distributed data storage Routing Distributed hash table Shortest path problem Travelling salesman problem Tree decomposition Koorde Pastry Graph theory Theoretical computer science Mathematics
79	Route Search over Probabilistic Geospatial Data Yaron Kanza1, , Eliyahu Safra2 , and Yehoshua Sagiv3, 1 2 Technion—Israel Institute of Technology Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2009-05-26 06:50:03 Approximation algorithm Computational complexity theory Travelling salesman problem Statistical hypothesis testing Theoretical computer science Statistics Applied mathematics
80	Revisiting Elitism in Ant Colony Optimization Tony White, Simon Kaegi, Terri Oda School of Computer Science, Carleton University 1125 Colonel By Drive, Ottawa, Ontario, Canada K1S 5B6 , skaegi@sym Add to Reading List Source URL: terri.zone12.com Language: English - Date: 2007-07-05 20:33:39 Theoretical computer science Ant colony optimization algorithms Stochastic optimization Travelling salesman problem Ant Swarm behaviour Mathematical optimization Algorithm Lin–Kernighan heuristic Mathematics Applied mathematics Operations research

UPDATE